home *** CD-ROM | disk | FTP | other *** search
/ Aminet 5 / Aminet 5 - March 1995.iso / Aminet / dev / misc / LEDA_gene.lha / LEDA-3.1c-generic / incl / LEDA / sweep_segments.h < prev    next >
Encoding:
C/C++ Source or Header  |  1994-08-05  |  1.0 KB  |  39 lines
  1. /*******************************************************************************
  2. +
  3. +  LEDA  3.1c
  4. +
  5. +
  6. +  sweep_segments.h
  7. +
  8. +
  9. +  Copyright (c) 1994  by  Max-Planck-Institut fuer Informatik
  10. +  Im Stadtwald, 6600 Saarbruecken, FRG     
  11. +  All rights reserved.
  12. + 
  13. *******************************************************************************/
  14.  
  15.  
  16. #ifndef LEDA_SWEEPSEGMENTS_H
  17. #define LEDA_SWEEPSEGMENTS_H
  18.  
  19. #include <LEDA/plane_graph.h>
  20.  
  21. //------------------------------------------------------------------------------
  22. // line sweep for straight line segments
  23. //------------------------------------------------------------------------------
  24.  
  25. void SWEEP_SEGMENTS(const list<segment>&, const list<segment>&, 
  26.                                           GRAPH<point,int>&);
  27.  
  28. void SWEEP_SEGMENTS(const list<segment>&, list<point>&);
  29.  
  30.  
  31. inline void SWEEP_SEGMENTS(const list<segment>& L, GRAPH<point,int>& G)
  32. { list<segment> dummy;
  33.   SWEEP_SEGMENTS(L,dummy,G); }
  34.  
  35. inline void SEGMENT_INTERSECTION(const list<segment>& L, list<point>& P)
  36. { SWEEP_SEGMENTS(L,P); }
  37.  
  38. #endif
  39.